Weak forms of Mann's density theorem extended to sets of lattice points

Economical coverings of sets of lattice points

Let t(n, d) be the minimum number t such that there are t of the n lattice points {(x1, . . . , xd) : 1 ≤ xi ≤ n} so that the ( t 2 ) lines that they determine cover all the above n lattice points. We prove that for every integer d ≥ 2 there are two positive constants c1 = c1(d) and c2 = c2(d) such that for every n c1n d(d−1)/(2d−1) ≤ t(n, d) ≤ c2n log n. The special case d = 2 settles a proble...

Counting Lattice Points in Admissible Adelic Sets

the effect of creative writing instruction on lexical density of advanced efl learners writing

چکیده ندارد.

Bisections of Two Sets of Points in the Plane Lattice

Assume that 2m red points and 2n blue points are given on the lattice Z2 in the plane R2. We show that if they are in general position, that is, if at most one point lies on each vertical line and horizontal line, then there exists a rectangular cut that bisects both red points and blue points. Moreover, if they are not in general position, namely if some vertical and horizontal lines may conta...

Modular Forms and the Chebotarev Density Theorem

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...